A P2P Meta-index for Spatio-temporal Moving Object Databases
نویسندگان
چکیده
In this paper we propose a distributed meta-index using a peer-to-peer protocol to allow spatio-temporal queries of moving objects on a large set of distributed database servers. We present distribution and fault tolerance strategies of a meta-index that combines partial trace of object movements with aggregated data about the number of objects in the database servers. The degrees of distribution and fault tolerance were compared by using discrete-event simulators with demanding spatiotemporal workloads. The results show that the distributed meta-index using Chord provides good performance, scalability and fault tolerance.
منابع مشابه
Searching Moving Objects in a Spatio-temporal Distributed Database Servers System
Querying about the time-varying locations of moving objects is particularly cumbersome in environments composed of a very large number of distributed spatio temporal database servers. In particular, searching for a specific object can require to visit each server. In this paper we propose a strategy to avoid such an exhaustive search that is based on the use of a centralized index, called meta-...
متن کاملModeling Historical and Future Spatio-temporal Relationships of Moving Objects in Databases
Moving object databases have recently found large interest in the database community, geographical information systems, and geosciences. So far, moving object models have focused exclusively either on past or future movements. The so-called Balloon Model is the first attempt to treat past and future movements of moving objects in a consistent and integrated manner. Based on a new set of spatio-...
متن کاملMoving Objects Databases
Moving objects databases are particular cases of spatiotemporal databases that represent and manage changes related to the movement of objects. Unlike spatio-temporal applications associated with geographic phenomena where the identity of geographic features may change over time, in moving objects databases the objects maintain their identities but change their locations or shapes through time....
متن کاملClosest pair queries in spatio-temporal databases
In recent years, spatio-temporal databases have been studied intensively. This paper proposes how to process k closest pair queries in spatio-temporal databases for the first time. A spatio-temporal k closest pair query continuously searches the k closest pairs between a set of spatial objects and a set of moving objects for a specified time interval of the query. To maintain the order of the k...
متن کاملComplex Queries for Moving Object Databases in DHT-Based Systems
Distributed moving object database servers are a feasible solution to the scalability problem of centralized database systems. In this paper we propose a distributed indexing method, using the Distributed Hash Table (DHT) paradigm, devised to efficiently support complex spatio temporal queries. We assume a setting in which there is a large number of database servers that keep track of events as...
متن کامل